Semidefinite Representability of the Trace of Totally Positive Laurent Polynomial Matrix Functions

نویسنده

  • MICHEL BAES
چکیده

Abstract. The function that maps a positive semidefinite matrix to the trace of one of its nonnegative integer power is semidefinite representable. In this note, we reduce the size of this semidefinite representation from O(kn) linear matrix inequalities of dimension n, where k is the desired power and n× n the size of the matrix to O(log 2 (k)) linear matrix inequalities of dimension 2n. We also propose a variant of our strategy that can deal with traces of negative powers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Semidefinite Representations of Non-closed Sets

Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinite representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in semidefinite programming. There are several recent results on the question which sets are semidefinite representable. So far, all results focus on the case of ...

متن کامل

Polynomial Matrix Inequality and Semidefinite Representation

Consider a convex set S = {x ∈ D : G(x) o 0} where G(x) is a symmetric matrix whose every entry is a polynomial or rational function, D ⊆ R is a domain on which G(x) is defined, and G(x) o 0 means G(x) is positive semidefinite. The set S is called semidefinite representable if it equals the projection of a higher dimensional set which is defined by a linear matrix inequality (LMI). This paper s...

متن کامل

Lower bounds on matrix factorization ranks via noncommutative polynomial optimization

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive semidefinite rank, and their symmetric analogues: the completely positive rank and the completely positive semidefinite rank. We study the convergence properties of o...

متن کامل

Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone

We investigate the completely positive semidefinite cone CS+, a new matrix cone consisting of all n×n matrices that admit a Gram representation by positive semidefinite matrices (of any size). In particular, we study relationships between this cone and the completely positive and the doubly nonnegative cone, and between its dual cone and trace positive non-commutative polynomials. We use this n...

متن کامل

Singular value inequalities for positive semidefinite matrices

In this note‎, ‎we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique‎. ‎Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl‎. ‎308 (2000) 203-211] and [Linear Algebra Appl‎. ‎428 (2008) 2177-2191]‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009